Shifted matroid optimization
نویسندگان
چکیده
We show that finding lexicographically minimal n bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted optimization problem over a matroid can be solved in polynomial time as well. We also solve these problems for intersections of strongly base orderable matroids. © 2016 Elsevier B.V. All rights reserved.
منابع مشابه
Lexicographic Matroid Optimization
We show that finding lexicographically minimal n bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted problem over a matroid can be solved in polynomial time as well.
متن کاملThe Catalan matroid
We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the “Catalan matroid” Cn. We describe this matroid in detail; among several other results, we show that Cn is self-dual, it is representable over Q but not over finite fields Fq with q ≤ n− 2, and it has a nice Tutte polynomial. We then generalize our construction to obtain a family of matroids, whic...
متن کاملRelaxations of the matroid axioms I: Independence, Exchange and Circuits
Motivated by a question of Duval and Reiner about higher Laplacians of simplicial complexes, we describe various relaxations of the defining axioms of matroid theory to obtain larger classes of simplicial complexes that contain pure shifted simplicial complexes. The resulting classes retain some of the matroid properties and allow us to classify matroid properties according to the relevant axio...
متن کاملThe Base-matroid and Inverse Combinatorial Optimization Problems
A new matroid is introduced: this matroid is de0ned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the 0eld of inverse combinatorial optimization problems. We discuss in detail the LP fo...
متن کاملA Relative Laplacian Spectral Recursion
The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and the relative simplicial pair of the deletion modulo the contraction. We generalize this recursion to relative simplicial pairs, which we interpret as convex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 44 شماره
صفحات -
تاریخ انتشار 2016